By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents
Volume 10, Issue 3, pp. 337-514

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Bounding the Size of Planar Intertwines

Arvind Gupta and Russell Impagliazzo

pp. 337-358

The Length of a Leaf Coloration on a Random Binary Tree

A. M. Hamel and M. A. Steel

pp. 359-372

Classes of Graphs that Are Not Vertex Ramsey

H. A. Kierstead

pp. 373-380

New Ramsey Bounds from Cyclic Graphs of Prime Order

Neil J. Calkin, Paul Erdos, and Craig A. Tovey

pp. 381-387

Linear Steiner Trees for Infinite Spirals

J. F. Weng

pp. 388-398

Asteroidal Triple-Free Graphs

Derek G. Corneil, Stephan Olariu, and Lorna Stewart

pp. 399-430

A Lower Bound for Adjacencies on the Traveling Salesman Polytope

A. Sarangarajan

pp. 431-435

Counting Problems Associated With Steiner Trees In Graphs

J. Scott Provan and Manoj K. Chari

pp. 436-446

Optimal Cycle Codes Constructed From Ramanujan Graphs

Jean-Pierre Tillich and Gilles Zémor

pp. 447-459

A Construction for (t,m,s)-nets in Base q

Michael J. Adams and Bryan L. Shader

pp. 460-468

Computing All Small Cuts in an Undirected Network

Hiroshi Nagamochi, Kazuhiro Nishimura, and Toshihide Ibaraki

pp. 469-481

A Threshold Function for Harmonic Update

Shao C. Fang and Santosh S. Venkatesh

pp. 482-498

A Combinatorial Proof for Stockhausen's Problem

Lily Yen

pp. 499-504

Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs

Mourad Baïou and Ali Ridha Mahjoub

pp. 505-514